Method of hashing vector data based on multi-scale curvature for vector content authentication

ABSTRACT

The present invention relates to a method of hashing a perceptual vector model based on a multi-scale curvature. According to a first aspect, there is provided a method of hashing a perceptual vector model based on a multi-scale curvature including: generating a multi-dimensional feature coefficient matrix, and obtaining a multi-dimensional intermediate hash coefficient matrix; and obtaining a final binary hash matrix, and enabling the multi-dimensional binary hash matrix to be hierarchically authenticated. In addition, according to a second aspect, there is provided a method of hashing a perceptual vector model based on a multi-scale curvature including: generating a hash by using a hash function; and authenticating a vector model. In addition, an error detection probability for an object attack can be lower by about 2×10 −5 ˜2.8×10 −2 , and a uniqueness probability is raised by about 0.014. In addition, an entropy can be raised by about 0.875˜2.149.

CROSS-REFERENCE TO RELATED APPLICATION

The present application is a continuation application of International Application No. PCT/KR2017/018171 filed on Feb. 21, 2017, which claims priority to Korean Application No. KR 10-2017-0020769 filed on Feb. 15, 2017. The applications are incorporated herein by reference.

TECHNICAL FIELD

The present invention relates to a method of hashing a perceptual vector model based on a multi-scale curvature. More particularly, the present invention relates to a method of hashing a perceptual vector model based on a multi-scale curvature, the method purposing a vector data hashing method required for authenticating a vector data model and preventing the vector data model from being copied since application fields of the vector data model such as CAD design drawings and geographic information system (GIS) digital maps become wide, thus a protection method therefor is required.

BACKGROUND ART

2D/3D vector models have been widely used for various application contents for a long time, such as CAD design drawings used in industries such as architecture, automobiles, shipbuilding and IT hardware, digital vector maps of geographic information systems, and 3D printer STL models. In addition to the activation of the vector models, there have been various studies on the watermarking technique for the copyright protection of GIS vector maps and CAD design drawings, and the perceptual or parametric encryption technique for the authentication and integrity verification. However, Delp raised the importance of content authentication, not copyright protection, as well as business model changes toward the 22nd century content security technology.

There are two representative multimedia authentication techniques: cryptographic hashing and content perceptual hashing. Cryptographic hashing is sensitive to bit changes, thus it is not suitable for multimedia or contents that can be transformed into various forms while the quality is maintained. Until now, perceptual hashing for an image, a video, and a 3D mesh model which satisfy robustness and security requirements has been presented by many researchers. Perceptual hashing, such as watermarking, must be differently applied according to a data structure of the multimedia or content. For example, image and video are configured with frames or images such as pixel arrays having fixed positions and sizes. For perceptual hashing methods, methods based on a spatial domain of pixels, the frequency domain of polar Fourier transform (PFT), quaternion polar cosine transform (PCT), discrete cosine transform (DCT), and spatial-temporal domain are purposed. A 3D mesh model is configured with triangular meshes with regular or unfixed 3D vertex coordinates. 3D mesh perceptual hashing methods which are based on a geometric shape feature distribution, and a mesh heat kernel signature (HKS) have been purposed. However, methods for hashing an image, a video, and a 3D modeling are not applicable to CAD design drawings based on a polygonal shape vector (components) such as polygon, polyline, etc. and to a vector data model such as GIS vector map.

A vector data model is configured with a number of layers, and a modeling thereof is performed by using a primitive component such as points, polylines, polygons, and ellipses in each layer. Herein, different to a 3D mesh model, each primitive component is independent and does not have correlation with another component. Recently, a vector model authentication method and copyright protection method based on a cryptographic hash and a zero-watermark such as SHA-1, MD5, etc. have been purposed. However, a cryptographic hash is easily changed by vector model editing, and the vector shape features used in zero-watermark are not robust and secure against various attacks. Lee et al. presented a single hashing method of a vector model based on primary and secondary polyline curvature coefficient distributions using a Frenet frame and a generalized curvature. The primary and secondary polyline curvature coefficient distributions have robustness against attacks such as re-parameterization, Euclidean transformation, rearrangement, and object simplification. However, recently, as the scale, volume, and precision of vector models have increased, robustness and security performances are not satisfied by a single hash authentication.

Accordingly, development of a method of hashing a vector model based on a multi-scale curvature, the method providing efficient hierarchical authentication of a vector map with high accuracy or a design drawing, and having excellent robustness, uniqueness, and security performances, has been required.

SUMMARY

Accordingly, the present invention has been made keeping in mind the above problems occurring in the prior art, and an object of the present invention is to provide a method of hashing a perceptual vector model based on a multi-scale curvature, wherein the method generates a hash being robust against various attacks and satisfying security by a random key and uniqueness performances by grouping polylines on a main layer within a vector data model, generating a group coefficient according to primary and secondary polyline curve curvature distributions, obtaining a feature coefficient by projecting the group coefficient onto a random pattern, and generating a final binary hash by performing binarization for the same.

In addition, the present invention is to provide a method of hashing a perceptual vector model based on a multi-scale curvature in which an error detection probability for an object attack such as object simplification, removing, copying, breaking, etc. is lower than a conventional method by about 2×10⁻⁵˜2.8×10⁻². In addition, the purposed method has a uniqueness probability being higher by about 0.014 than a conventional method when hash uniqueness is evaluated for three types of a model-key, a key, and a model.

In addition, the present invention is to provide a method of hashing a perceptual vector model based on a multi-scale curvatures in which an entropy is higher by about 0.875˜2.149 than an entropy of a conventional method when security performance is evaluated based on a differential entropy.

However, objects of the present invention are not limited to the objects described above, and other objects that are not described will be clearly understood by a person skilled in the art from the description below.

In order to accomplish the above object, a method of hashing a perceptual vector model based on a multi-scale curvature according to an embodiment of the present invention includes: generating a multi-dimensional feature coefficient matrix based on a multi curvature action energy distribution of a radius curvature, a turning angle curvature, and a Gaussian curvature for all polylines and polygon objects, and obtaining a multi-dimensional intermediate hash coefficient matrix by performing randomized mapping by using partial exponential bell polynomials for the generated multi-dimensional feature coefficient matrix with a random coefficient; and obtaining a final binary hash matrix by applying a Lloyd-Max quantizer to a real number type intermediate hash coefficient matrix, and enabling the multi-dimensional binary hash matrix to be hierarchically authenticated in a scale and a curvature type according to a security level of a vector model.

In order to accomplish the above object, a method of hashing a perceptual vector model based on a multi-scale curvature according to another embodiment of the present invention includes: generating a hash by using a hash function hash(M.R)=(H.θ) based on a multi-scale curvature; and authenticating a vector model by using a hash extraction function Dehash(M′.R.θ)=H′.

Herein, the hash function may includes: performing rectangular tiling; performing object re-sampling within a tile; calculating a multi curvature for each scale; and generating a binary hash by using a Lloyd-Max quantizer, and a multi-scale curvature hash coefficient based on a key.

In addition, the generating of the hash may includes: when performing rectangular tiling, in order to authenticate the vector model based on a hash for each tile in a vector model M with high accuracy and capacity, generating M={Mj} obtained by dividing the vector model M having a NH×NV size into a rectangular tile having a Nh×Nv size; and generating M_(j)={p_(i)}_(i=1) ^(|M) ^(j) ^(|) by extracting polygon and polyline objects among objects belonging to a number of layers within the divided tile, wherein when an entire size of the vector model M is NH×NV, and a ratio scale is 1/RS, the NH×NV size and an actual size of NH×NV may be calculated as (NH×RS×10⁻⁵)×(NV×RS×10⁻⁵)=NH×NV×RS²×10⁻¹⁰[km²] N_(H)×N_(V)×RS²×10⁻¹⁰[km²].

In addition, in the generating of the hash, in order to ensure hash robustness when performing object sampling, objects may be re-sampled in the same interval δ when generating and extracting the hash, and then re-sampled virtual vertices are generated, when an original object p={v_(i)}_(i=1) ^(p) is provided, a sample vertex for the same sampling interval δ may be {circumflex over (p)}={v_(k)}, when a sample vertex vk is between vi−1 and vi, the sample vertex vk may become v_(k)=v_(k−1)+Δd_(k),∥Δd_(k)∥=δ,v_(k)=(x_(k),y_(k))=(x_(k−1)+Δd_(x),y_(k−1)+Δd_(y)); f(x_(k))=y_(k) by a cubic curve polynomial (cubic polynomial curve) expression corresponding to left/right four vertices {v_(k−2)·v_(k−1)·v_(i)·v_(i−1)} which are two previous re-sampled vertices {v_(k−2)·v_(k−1)} and two ensuing original vertices {v_(i)·v_(i−1)}, herein, the sample vertex v_(k) corresponding to two previous re-sampled vertices {v_(k−2)·v_(k−1)} and two ensuing original vertices {v_(i)·v_(i+1)} may be represented as v_(k−2)<v_(k−1)<v_(k)<v_(i)<v_(i+1), and as a boarder tile of an object end point, when the sample vertex v_(k) is before a last original vertex v_(n), that is v_(k−2)<v_(k−1)<v_(k)<v_(n), or after, that is v_(k−2)<v_(k−1)<v_(n)<v_(k), the sample vertex v_(k) may be determined by quadratic curve C_(k)(v_(k)): f(x)=a₀+a₁x+a₂x²+a₃x³ modeling that corresponds to three vertices of {v_(k−2)·v_(k−1)·v_(n)}.

A method of hashing a perceptual vector model based on a multi-scale curvatures according to an embodiment of the present invention can generate a hash being robust against various attacks and satisfying security by a random key and uniqueness performances by grouping polylines on a main layer within a vector data model, generating a group coefficient according to primary and secondary polyline curve curvature distributions, obtaining a feature coefficient by projecting the group coefficient onto a random pattern, and generating a final binary hash by performing binarization for the same.

In addition, in a method of hashing a perceptual vector model based on a multi-scale curvature according to another embodiment of the present invention, an error detection probability for an object attack such as object simplification, removing, copying, breaking, etc. can be lower than a conventional method by about 2×10⁻⁵˜2.8×10⁻², and a uniqueness probability is higher by about 0.014 than a conventional method when hash uniqueness is evaluated for three types of a model-key, a key, and a model.

In addition, in a method of hashing a perceptual vector model based on a multi-scale curvatures according to another embodiment of the present invention, an entropy can be higher by about 0.875˜2.149 than an entropy of a conventional method when security performance is evaluated based on a differential entropy.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 is a view showing a process of generating a hash based on a multi-scale curvature (FIG. 1a ), and authenticating a vector model by extracting a hash (FIG. 1b ) which are purposed in a multi-scale curvature based perceptual vector model hashing method according to an embodiment of the present invention.

FIG. 2 is a view showing an example of performing rectangular tiling and separating a layer within the tile, and a vector map having a transverse Mercator (TM) coordinate system in the multi-scale curvature based perceptual vector model hashing method according to an embodiment of the present invention.

FIG. 3 is a view showing re-sampling of an arbitrary object in the multi-scale curvature based perceptual vector model hashing method according to an embodiment of the present invention.

FIG. 4 is a view showing an example of a threshold variable l′ required when determining a primary object in the multi-scale curvature based perceptual vector model hashing method according to an embodiment of the present invention.

FIG. 5 is a view showing re-sampling is performed when a spatial scale is s=1 and an interval is δ, and when a spatial scale is s=¼ and an interval is 4δ in the multi-scale curvature based perceptual vector model hashing method according to an embodiment of the present invention.

FIG. 6 is a view showing a process of generating an intermediate hash matrix having a size obtained by using an object curvature energy for scales×curvatures×objects and partial exponential bell polynomials, and generating a binary hash matrix of m bits by using a Llyoyd-Max quantizer in the multi-scale curvature based perceptual vector model hashing method according to an embodiment of the present invention.

FIG. 7 is a view showing a process of generating an intermediate hash coefficient by using a number of group coefficients of object curvature energies and a random coefficient in the multi-scale curvature based perceptual vector model hashing method according to an embodiment of the present invention.

FIG. 8 is a view showing an ROC curve of a hash authentication threshold in the multi-scale curvature based perceptual vector model hashing method according to an embodiment of the present invention.

DETAILED DESCRIPTION

Hereinafter, an exemplary embodiment of the present disclosure will be described with reference to the accompanying drawings. In the following description, the same elements will be designated by the same reference numerals although they are shown in different drawings. Further, in the following description of the present disclosure, a detailed description of known functions and configurations incorporated herein will be omitted when it may make the subject matter of the present disclosure rather unclear.

In the present invention, when any component “transmits” data or a signal to another component, the component may directly transmit the data or the signal to the other component, or may mean that data or signal may be transmitted to other components via at least one other component.

A method for hashing a perceptual vector model based on a multi-scale curvature purposes a method of hashing a vector model based on a multi-scale curvature which provides a hierarchical authentication and has excellent robust, uniqueness, and security performances. Main features of the purposed vector model hashing methods are as follows.

1) Re-sampled object curvature action energy: a method purposed in the present invention generates a hash based on a multi-scale curvature action energy of a radius curvature, a turning angle curvature, and Gaussian curvature, and which is invariant for a rigid motion, and robust against shape deformation. Object re-sampling is robust against changes in a number of vertices such as vector model simplification, vertex interpolation, etc.

2) Random key based scale-curvature multi-dimensional hash authentication: a method purposed in the present invention generates a multi-dimensional hash based on a curvature action energy on a spatial scale, and authenticates a model by hash comparison for each dimension. Herein, an arbitrary hash coefficient is calculated by performing randomized mapping curvature action energy for each scale with a random coefficient by using partial exponential bell polynomials. Randomized mapping of the curvature action energy increases both security and uniqueness performances. The multi-dimensional hash enables hierarchical authentication in a scale and a curvature type according to a security level of public and private vector.

Meanwhile, main symbols used in the present invention are as follows.

1) A Vector model M is configured with a number M of polylines and polygon objects p,

2) an object p is configured with a number |p| of vertices, that is p={v_(i)}_(i=1) ^(p), a curve p that is v_(l−1)v_(l) is a group of line segments, and

3) the entire length of the object p is ∥p∥, and a number of vertices which are elements of the object is |p|.

4) A re-sampled object of p is {circumflex over (p)}, and a curvature for each vertex on a spatial scale s is t^(s). An average curvature energy per unit length of {circumflex over (p)}_(s) is υ[{circumflex over (p)}_(s)].

5) When a vector model M and a random coefficient R are provided, by a hash function hash(M.R)=(H.θ), a binary hash H and a parameter θ are generated. When a transmitted vector model M′, a parameter θ, and a random coefficient R are provided, by Dehash(M′.R.θ)=H′, a binary hash H is extracted.

FIG. 1 is a view showing a process generating a hash based on a multi-scale (FIG. 1a ) purposed in the present invention, and a process of authenticating a vector model by using a hash extraction process (FIG. 1b ). Referring to FIG. 1, a method of hashing a perceptual vector based on multi-scale curvatures purposed in the present invention shows a process of authenticating a vector model by using generating a hash by a hash function hash(M.R)=(H.θ) based on a multi-scale curvature, and by using a hash extraction function Dehash(M′.R.θ)=H′. The purposed hash function is configured with: performing rectangular tiling, re-sampling object within the tile, calculating a multi-scale curvature for each scale, and generating a binary hash by using a key based multi-scale curvature hash coefficient and a Lloyd-Max quantizer.

Then, rectangular tiling will be described in detail.

First, when performing rectangular tiling, a vector map that is a vector model M with high capacity and accuracy includes main information for each tile such as roads, mountains, parks, buildings, etc., and is represented in a number of objects. Accordingly, in the vector model M, it is effective to authenticate the vector model M based on a hash for each tile.

In the purposed method, the vector model M having a NH×NV size is divided in rectangular N_(H)×N_(V) tiles which are M={M_(j)}, and polygon and polyline objects belonging to a number of layers within the divided tile are extracted, M_(j)={p_(i)}_(i=1) ^(|M) ^(j) ^(|). Herein, when the entire size of the vector model M is NH×NV, and a ratio scale is 1/RS, actual areas of NH×NV and N_(H)×N_(V) are as Formula 1 below. (NH×RS×10⁻⁵)×(NV×RS×10⁻⁵)=NH×NV×RS ²×10⁻¹⁰[km ²] N _(h) ×N _(v) ×RS ²×10⁻¹⁰ [km ²]  [formula 1]

For example, in a vector map in which ratio scales are 1/10,000, and 1/100,000, the divided tiles respectively have an area of N_(H)N_(V)10⁻²[km²],N_(H)N_(V)[km²]. FIG. 2 is a view showing an example of performing rectangular tiling and separating into layers within the divided tile in a vector map having a transverse Mercator (TM) coordinate system.

Hereinafter, generating a hash of the divided tile M_(j)={p_(i)}_(i=1) ^(M) ^(j) will be described.

First, object sampling will be described. FIG. 3 is a view illustrating re-sampling of an arbitrary object.

While a geometric shape of the vector model is maintained, a number of vertices may be changed by polyline and polygon simplification or interpolation, or may be changed in positions by vertex random sampling. In the purposed method, for robustness of a hash, in generating and extracting a hash, objects are resampled in the same interval δ, and re-sampled virtual vertices are generated.

When an original object p={v_(i)}_(i=1) ^(p) is provided, a sample vertex for sampling in the same interval δ is {circumflex over (p)}={v_(k)}. When a sample vertex v_(k) is between v_(i−1) and v_(i), as shown in FIG. 3, by a cubic curve polynomial expression (cubic polynomial curve) C_(k)(v_(k)):f(x)=a₀+a₁x+a₂x²+a₃x³ corresponding to four vertices {v_(k−2)·v_(k−1)·v_(i)·v_(i−1)} which are two previous resampled vertices {v_(k−2)·v_(k−1)} and two ensuing original vertices {v_(i)·v_(i−1)}, v_(k) may be as Formula 2 below.

$\begin{matrix} {{{v_{k} = {v_{k - 1} + {\Delta\; d_{k}}}},{{{\Delta\; d_{k}}} = \delta},{{v_{k} = {\left( {x_{k},y_{k}} \right) = \left( {{x_{k - 1} + {\Delta\; d_{x}}},{y_{k - 1} + {\Delta\; d_{y}}}} \right)}};}}{{f\left( x_{k} \right)} = y_{k}}} & \left\lbrack {{Formula}\mspace{14mu} 2} \right\rbrack \end{matrix}$

Herein, v_(k) corresponding to two previous re-sampled vertices {v_(k−2)·v_(k−1)} and two ensuing original vertices {v_(i)·v_(i+1)} is represented as v_(k−2)<v_(k−1)<v_(k)<v_(i)<v_(i+1). As a boarder tile of an object end point, when v_(k) is before the last original vertex v_(n), that is v_(k−2)<v_(k−1)<v_(k)<v_(n), or after, that is v_(k−2)<v_(k−1)<v_(n)<v_(k), v_(k) is determined by quadratic curve C_(k)(v_(k)):f(x)=a₀+a₁x+a₂x²+a₃x³ modeling that corresponds to three vertices of {v_(k−2)·v_(k−1)·v_(n)}.

Describing a cubic polynomial coefficient, parameters of a cubic curve are determined by a cubic polynomial regression model. In other words, in Formula 3 below which is a cubic polynomial expression, when a coefficient vector is A and a random error vector is E, a response vector T may be represented as Formula 4 below.

$\begin{matrix} {{{{C_{k}\left( v_{k} \right)};{y = {f(x)}}},{y_{k} = {a_{0} + {a_{1}x} + {a_{2}x^{2}} + {a_{3}x^{3}} + ɛ_{k}}}}\;{for}\left\{ {v_{k - 2},v_{k - 1},v_{i},v_{i + 1}} \right\}} & \left\lbrack {{Formula}\mspace{14mu} 3} \right\rbrack \\ {{Y = {{XA} + E}},{\begin{bmatrix} y_{k - 2} \\ y_{k - 1} \\ y_{i} \\ y_{i + 1} \end{bmatrix} = {{\begin{bmatrix} 1 & x_{k - 2} & {x_{k - 2}}^{2} & {x_{k - 2}}^{3} \\ 1 & x_{k - 1} & {x_{k - 1}}^{2} & {x_{k - 1}}^{3} \\ 1 & x_{i} & {x_{i}}^{2} & {x_{i}}^{3} \\ 1 & x_{i + 1} & {x_{i + 1}}^{2} & {x_{i + 1}}^{3} \end{bmatrix}\begin{bmatrix} a_{0} \\ a_{1} \\ a_{2} \\ a_{3} \end{bmatrix}} + \begin{bmatrix} \epsilon_{0} \\ \epsilon_{1} \\ \epsilon_{2} \\ \epsilon_{3} \end{bmatrix}}}} & \left\lbrack {{Formula}\mspace{14mu} 4} \right\rbrack \end{matrix}$

Polynomial regression coefficients estimated by using an ordinary least squares estimation are as Formula 5 below. Â=(X ^(T) X)⁻¹ X ^(T) Y  [Formula 5]

Then, describing a sampling interval δ, the sampling interval is determined by a length distribution of main objects p* having high ranking lengths among the entire objects.

Setting an object length as a probability variable L=∥p*∥, when a maximum length is L_(max)=max{∥p*∥}, a cumulative distribution function of L is F_(L)(l)=Pr(L≤l), and an inverse function thereof is F_(L) ⁻¹(Pr(L≤i))=l. Herein, a variable l′ corresponding to an inflection point F_(l)″(l′)=0 of F_(l)(l) may be calculated as Formula 6 below. l′=F″ _(L) ⁻¹(0)  [Formula 6]

Herein, the main objects P* are objects corresponding to ∥p*∥≥l′, and the primary objects have a ratio of 1−F_(l)(l′)=1−Pr(L≤l′)=Pr(l′<L≤L_(max).) FIG. 4 is a view showing an example of a threshold variable of l′ required when determining a main object.

In other words, FIG. 4 is a view showing a graph of a threshold variable setting example required when determining a main object on a cumulative distribution of vector model objects.

When a group of main objects p* is P*, an average length ∥P*∥ of p* is as Formula 7 below.

$\begin{matrix} {{{\overset{\_}{P^{*}}} = {\frac{1}{\overset{\_}{P^{*}}}{\sum\limits_{i = 1}^{p^{*}}\;{p_{i}^{*}}}}},{{{where}\mspace{14mu}{p^{*}}} = {\sum\limits_{i = 1}^{p^{*}}{{v_{i} - v_{i - 1}}}}}} & \left\lbrack {{Formula}\mspace{14mu} 7} \right\rbrack \end{matrix}$

|P*| is cardinality of a group P*, and represents a number of main objects p* which are elements. The sampling interval δ is determined by Formula 8 below by providing a minimum length min{∥v_(l)v_(l−1) ∥∀p*∈P*} as ½ among all segments of main objects, and an average length of the main objects

$\begin{matrix} {\delta = \frac{\min\mspace{11mu}\left\{ {{\overset{\_}{v_{l}v_{l - 1}}}{\forall{p^{*} \in P^{*}}}} \right\}}{2{{\overset{\_}{P}}^{*}}}} & \left\lbrack {{Formula}\mspace{14mu} 8} \right\rbrack \end{matrix}$

A final re-sampled object is {circumflex over (p)}={v_(k)|k∈[1.|{circumflex over (p)}|]}, a length thereof ∥{circumflex over (p)}∥ is as Formula 9 below, and a number of vertices of re-sampled objects is as Formula 10 below.

$\begin{matrix} {{p} = {{{\sum\limits_{i = 1}^{p}\;{{v_{i} - v_{i - 1}}}} < {\hat{p}}} = {\sum\limits_{k = 1}^{\hat{p}}\mspace{11mu}{{v_{k} - v_{k - 1}}}}}} & \left\lbrack {{Formula}\mspace{14mu} 9} \right\rbrack \\ {{\hat{p}} = \left\lceil \frac{p}{\delta} \right\rceil} & \left\lbrack {{Formula}\mspace{14mu} 10} \right\rbrack \end{matrix}$

Then, a multi-scale curvature and curvature energy will be described, a multi-scale curvature is a sampling interval

$\frac{\delta}{s}$ for each spatial scale s in a re-sampled object {circumflex over (p)}={v_(k)|k∈[1.|{circumflex over (p)}|]}, and the re-sampled object is defined as Formula 11 below. {circumflex over (p)} ^(s) ={v _(k/s) |k∈[1·n _(s)]} where n _(s)=[|{circumflex over (p)} ^(s) |×s] s∈[1,½,⅓,¼, . . . ]   [Formula 11]

As shown FIG. 5, in a spatial scale of s=1, re-sampling is performed in an interval δ, when s=¼, re-sampling is performed in a 4δ interval. In other words, when the spatial scale s becomes large, the object is precisely represented, and when s becomes small, the object is proximately represented.

In the purposed method, for all vertices of a re-sampled object {circumflex over (p)}^(s) for each scale, a multi-scale curvature [τ_(g) ^(s)(k)·τ_(o) ^(s)(k)k·τ_(a) ^(s)(k)] of a Gaussian curvature τ_(g) ^(s)(k), a radius curvature τ_(g) ^(s)(k), and a turning angle curvature τ_(a) ^(s)(k) may be calculated by Formulas 12 to 14 below.

$\begin{matrix} {{{\tau_{g}^{s}(k)} = \frac{\begin{matrix} {{\left( {{\hat{p}}^{s} \star \left( G_{\sigma}^{\prime} \right)} \right)_{x}(k)\left( {{\hat{p}}^{s} \star G_{\sigma}^{''}} \right)_{y}(k)} -} \\ {\left( {{\hat{p}}^{s} \star G_{\sigma}^{''}} \right)_{x}(k)\left( {{\hat{p}}^{s} \star G_{\sigma}^{\prime}} \right)_{y}(k)} \end{matrix}}{{{\left( {{\hat{p}}^{s} \star G_{\sigma}^{\prime}} \right)_{x}(k)}}^{3}}}\mspace{11mu}{where}{G_{\sigma = 1}\left\lbrack {\frac{3}{11},\frac{5}{11},\frac{3}{11}} \right\rbrack}} & \left\lbrack {{Formula}\mspace{20mu} 12} \right\rbrack \\ {{\tau_{r}^{s}(k)} = \frac{1}{\gamma^{2}(k)}} & \left\lbrack {{Formula}\mspace{20mu} 13} \right\rbrack \end{matrix}$ where y(k) is the radius of circumcircle on (v_(k/s−1)v_(k/s),v_(k/s+1))

$\begin{matrix} {{{\Gamma_{a}^{s}(k)} = {\frac{2{{\angle\left( {\overset{\rightarrow}{{v_{k - 1}v_{k}},}\overset{\rightarrow}{v_{k}v_{k + 1}}} \right)}}}{{\overset{\rightarrow}{v_{k - 1}v_{k}}} + {\overset{\rightarrow}{v_{k}v_{k + 1}}}}}}\mspace{14mu}{where}\text{}\;{{{\angle\left( {\overset{\rightarrow}{{v_{k - 1}v_{k}},}\overset{\rightarrow}{v_{k}v_{k + 1}}} \right)}} = {\cos^{- 1}\left\langle {\frac{\overset{\rightarrow}{v_{k - 1}v_{k}}}{\overset{\rightarrow}{v_{k - 1}v_{k}}},\frac{\overset{\rightarrow}{v_{k}v_{k + 1}}}{\overset{\rightarrow}{v_{k}v_{k + 1}}}} \right\rangle}}} & \left\lbrack {{Formula}\mspace{20mu} 14} \right\rbrack \end{matrix}$

Then, the curvature energy will be described. An re-sampled object of an arbitrary object {circumflex over (p)}_(l) for each scale is {circumflex over (p)}_(l)={circumflex over (p)}_(l) ¹·{circumflex over (p)}_(l) ^(1/2)·{circumflex over (p)}_(l) ^(1/3)·{circumflex over (p)}_(l) ^(1/4), and curvature energyv[{circumflex over (p)}_(i) ^(s)] per unit length thereof is defined as Formula 15 below.

$\begin{matrix} {{{{{\psi\left\lbrack {\hat{p}}_{i}^{s} \right\rbrack} = {\frac{1}{{\hat{p}}_{i}^{s}}{\sum\limits_{k = 1}^{n_{s}}\;{{\tau^{2}\left( \frac{k}{s} \right)}{{v_{k/s} - v_{{k/s} - 1}}}}}}},{where}}\;{{{{\hat{p}}_{i}^{s}} = {\sum\limits_{k = 1}^{n_{s}}{{v_{k/s} - v_{{k/s} - 1}}}}},{{{for}\mspace{14mu} s} \in \left\lbrack {1,\frac{1}{2},\frac{1}{3},\frac{1}{4},\;\ldots}\; \right\rbrack}}}\;} & \left\lbrack {{Formula}\mspace{20mu} 15} \right\rbrack \end{matrix}$

Herein,

$\tau\left( \frac{k}{s} \right)$ represents a curvature at a position

$\frac{k}{s}.$

In the present invention, a curvature energy ψ[{circumflex over (p)}_(i) ^(s)] for each scale is simply marked as ψ_(i) ^(s). An average curvature energy ψ_(i) for each curvature and scale or an object {circumflex over (p)}_(i) is represented as a matrix having a scales×curvatures size as Formula 16 below.

$\begin{matrix} {\left. {\hat{p}}_{i}\rightarrow\psi_{i} \right. = \begin{bmatrix} v_{g,i}^{1} & v_{o,i}^{1} & v_{a,i}^{1} \\ v_{g,i}^{1/2} & v_{o,i}^{1/2} & v_{a,i}^{1/2} \\ v_{g,i}^{1/3} & v_{o,i}^{1/3} & v_{a,i}^{1/3} \\ v_{g,i}^{1/4} & v_{o,i}^{1/4} & v_{a,i}^{1/4} \\ \vdots & \vdots & \vdots \end{bmatrix}} & \left\lbrack {{Formula}\mspace{20mu} 16} \right\rbrack \end{matrix}$

In the present invention, a scale s is defined as a scale of s ∈ scales=1·½·⅓·¼. . . . . Multi-scale curvatures of a Gaussian curvature, a radius curvature, a turning angle are simply marked as curvature=[g, a, o].

Then, an intermediate hash matrix based on a curvature energy will be described.

First, curvature energy clustering will be described. A curvature energy ψ of unit per length for each scale and curvature of all re-sampled objects M_(j)={{circumflex over (p)}_(l)}_(i=1) ^(|M) ^(j) ^(|)within the divided tile M_(j) is a matrix having a scales×curvatures×M_(j) size as Formula 7 below. ψ={ψ}_(i=1) ^(|M) ^(j) ^(|) where ψ_(i)={ψ_(curvature,i) ^(s) |∀s∈[1,½,⅓, . . . ], curvature ∈[g,o,a]},   [Formula 17] where g: Direct Gaussian Curvature, o: Curvature Radius, a: Turning Angle Curvature

In the purposed method, as an intermediate hash of the divided tile M_(j), as shown in FIG. 6, by using a curvature energy matrix having a scales×curvatures×|M_(j)| size, an intermediate matrix (hash matrix) having a scales×curvatures size is defined.

In other words, FIG. 6 is a view showing a process of generating an intermediate hash matrix having a size obtained by an object curvature energy for each scales×curvatures×objects and partial exponential bell polynomials, and generating a binary hash matrix of m bits by using a Llyoyd-Max quantizer.

Meanwhile, when an object curvature energy ψ_(curvature) ^(s) for an arbitrary scale s and a curvature type curvature is as Formula 18 below, object curvature energies are clustered in a number of groups based on Gaussian mixture model (GMM)—expectation maximization (EM). ψ_(curvature) ^(s)={ψ_(curvature,1) ^(s),ψ_(curvature,2) ^(s), . . . ,ψ_(curvature,|M) _(j) _(|) ^(s)}  [Formula 18]

In other words, after randomly selecting a number N_(B) of initial variables θ_(n) ⁽⁰⁾=(ω_(n) ⁽⁰⁾·μ_(n) ⁽⁰⁾·Σ_(n) ⁽⁰⁾), n∈[1, N_(B)], a number N_(B) of groups based on GMM is obtained by calculating a variable θ_(n)=(ω_(n)·μ_(n)·Σ_(n)), n∈[1, N_(B)] having a maximum log-likelihood of ψ_(curvature) ³ by applying E-step and M-step.

$\begin{matrix} {G_{{curvature}.k}^{s} = \left\{ {{\psi_{{curvature},i}^{s}:{{\Pr\left( {\psi_{{curvature},i}^{s}❘\phi_{k}} \right)} > \left( {\psi_{{curvature},i}^{s}❘\phi_{k^{\prime}}} \right)}},{\forall{k^{\prime} \neq k}},{and},{k^{\prime} \in \left\lbrack {1,N_{B}} \right\rbrack}} \right\}} & \left\lbrack {{Formula}\mspace{20mu} 19} \right\rbrack \end{matrix}$

Herein, a parameter group θ_(curvature) ^(s)={θ_(curvature,k) ^(s)=(ω_(curvature,k) ^(s)μ_(curvature,k) ^(s)Σ_(curvature,k) ^(s)))|k∈[1·N_(B)]}, is information required for extracting a hash with a random coefficient key.

An intermediate hash matrix will be described. Similar to a number of object curvature energies for a scale and for each curvature type, a hash key R having a scale×curvature×N_(B) size with random coefficient is obtained by Formula 20 below.

$\begin{matrix} {{R = \left\{ {{r_{curvature}^{s}❘{\forall{s \in \left\lbrack {1,\frac{1}{2},\frac{1}{3},\;\ldots}\; \right\rbrack}}}\;,{{curvature} \in \left\lbrack {g,o,a} \right\rbrack}} \right\}}\;\mspace{79mu}{where}\;\mspace{79mu}{r_{curvature}^{s} = \left\{ {r_{curvature}^{s}❘{k \in \left\lbrack {1,N_{B}} \right\rbrack}} \right\}}} & \left\lbrack {{Formula}\mspace{20mu} 20} \right\rbrack \end{matrix}$

A group coefficient b_(curvature,k) ^(s) of an arbitrary group G_(curvature,k) ^(s) is defined as Formula 21 below by the product of an average curvature energy μ_(curvature,i) ^(s) and a random coefficient r_(curvature,k) ^(s) thereof as shown in FIG. 7.

Meanwhile, FIG. 7 is a view showing a process of generating an intermediate hash coefficient by using a number of groups of object curvature energies and a random coefficient. b _(curvature,k) ^(s) =r _(curvature,k) ^(s)×μ_(curvature,k) ^(s) for k∈[1,N _(B)]  [Formula 21]

An intermediate hash coefficient h′_(curvature) ^(s) curvature on an arbitrary scale and a curvature (s,curvature) is obtained by using partial exponential bell polynomials of a group coefficient {b_(curvature,k) ^(s)}_(k=1) ^(N) ^(B) of an average curvature energy, which is B_(n,m)(b₁,b₂, . . . ,b_(N) _(B) ). In other words, h′_(curvature) ^(s) may be simply defined as Formula 22 below.

$\begin{matrix} {h_{curvature}^{\prime\; s} = {{B_{n,m}\left( {b_{{curvature},1}^{s},b_{{curvature},2}^{s},\ldots\mspace{14mu},b_{{curvature},N_{B}}^{s}} \right)} = {\sum{\frac{n!}{{j_{1}!}{j_{2}!}\mspace{14mu}\ldots\mspace{14mu}{j_{n - m + 1}!}}\left( \frac{b_{{curvature},1}^{s}}{1!} \right)^{j_{1}}\left( \frac{b_{{curvature},k}^{s}}{2!} \right)^{j_{2}}\mspace{14mu}\ldots\mspace{14mu}\left( \frac{b_{{curvature},k}^{s}}{\left( {n - m + {1!}} \right)} \right)^{j_{n - m + 1}}}}}} & \left\lbrack {{Formula}\mspace{20mu} 22} \right\rbrack \end{matrix}$

In addition, when n−m−1=N_(B), h′_(curvature) ^(s) may be schematically represented as Formula 23 below.

$\begin{matrix} {h_{curvature}^{\prime\; s} = {{n!}{\sum\left( {\prod\limits_{k = 1}^{N_{B}}\;{\frac{1}{j_{k}!}\left( \frac{b_{{curvature},k}^{s}}{k!} \right)^{j_{k}}}} \right)}}} & \left\lbrack {{Formula}\mspace{20mu} 23} \right\rbrack \end{matrix}$

Herein, in the summation term, j₁,j₂, . . . ,j_(N) _(B) are negative integers satisfying two conditions of Formula 24 below. j ₁ +j ₂ + . . . +j _(N) _(B) =m j ₁+2j ₂+3j ₃ + . . . +N _(BjN) _(B) =n  [Formula 24]

In the purposed method, n set as n=N_(B)+1,m=2, and a group coefficient is set to be N_(B)=10. Herein, partial exponential bell polynomials B_(11,2)(b₁,b₂, . . . ,b_(N) _(B) ) are as Formula 25 below.

$\begin{matrix} {{B_{11,2}\left( {b_{1},b_{2},\ldots\;,b_{10}} \right)} = {{\sum{\frac{11!}{{j_{1}!}{j_{2}!}\mspace{14mu}\ldots\mspace{14mu}{j_{10}!}}\left( \frac{b_{1}}{1!} \right)^{j_{1}}\left( \frac{b_{2}}{2!} \right)^{j_{2}}\mspace{14mu}\ldots\mspace{14mu}\left( \frac{b_{10}}{10!} \right)^{j_{10}}}} = {{{11!}\left( {{\frac{b_{1}}{1!}\frac{b_{10}}{10!}} + {\frac{b_{2}}{2!}\frac{b_{9}}{9!}} + {\frac{b_{3}}{3!}\frac{b_{8}}{8!}} + {\frac{b_{4}}{4!}\frac{b_{7}}{7!}} + {\frac{b_{5}}{5!}\frac{b_{6}}{6!}}} \right)} = {{11b_{1}b_{10}} + {55b_{2}b_{9}} + {165b_{3}b_{8}} + {330b_{4}b_{7}} + {462b_{5}b_{6}}}}}} & \left\lbrack {{Formula}\mspace{20mu} 25} \right\rbrack \end{matrix}$

By the above polynomial expression, an intermediate hash matrix {acute over (H)} having a scales×curvatures size for all scales and curvature types is obtained as Formula 26 below.

$\begin{matrix} {H^{\prime} = \begin{bmatrix} h_{g}^{\prime\; 1} & h_{0}^{\prime\; 1} & h_{a}^{\prime\; 1} \\ h_{g}^{\prime\;{1/2}} & h_{0}^{\prime\;{1/2}} & h_{a}^{\prime\;{1/2}} \\ h_{g}^{\prime\;{1/3}} & h_{0}^{\prime\;{1/3}} & h_{a}^{\prime\;{1/3}} \\ h_{g}^{\prime\;{1/4}} & h_{0}^{\prime\;{1/4}} & h_{a}^{\prime\;{1/4}} \\ \vdots & \vdots & \vdots \end{bmatrix}} & \left\lbrack {{Formula}\mspace{20mu} 26} \right\rbrack \end{matrix}$

Then, a binary hash matrix based on a Lloyd-Max quantizer will be described.

A real number type coefficient {acute over (h)}_(curvature) ³ of an intermediate hash matrix {acute over (H)} is binarized to a hash coefficient h_(curvatrure) ^(s) having mbit by using an mbit=(2^(m)−level) Lloyd−Max Quantizer.

Herein, two variables of the Lloyd-Max quantizer which are bin boundaries L and a replacement value (replacement value) z=({grave over (˜)}₁·{grave over (˜)}₂· . . . ·{grave over (˜)}₂y) are determined by a test model and sample intermediate hash matrices {{acute over (H)}^((t))}_(t=1) ¹⁰⁰⁰ for 1000 keys.

When a coefficient group h_(curvature) ^(s)={h_(curvature) ^(s(t))}_(t=1) ¹⁰⁰⁰ on an arbitrary (s,curvature) of the sample intermediate hash matrix {{acute over (H)}^((t))}_(t=1) ¹⁰⁰⁰ is provided, Bin boundaries L are L=(L₁,L₂, . . . ,L₂ _(m) ⁻¹); min({acute over (h)}_(curvature) ^(s))<L₁<L₂< . . . L₂ _(m) ⁻¹<max({acute over (h)}_(curvature) ^(s)), and a quantization function for L is as Formula 27 below. q({acute over (h)} _(curvature) ^(s))z _(j), for {acute over (h)} _(curvature) ^(s)∈[L _(j) ,L _(j+1)]  [Formula 27]

Herein, in order to minimize a quantization error E(L,z), L and z are obtained by Formula 28 below.

$\begin{matrix} {{E\left( {L,z} \right)} = {{\sum\limits_{i = 1}^{2^{m}}\;{{{q\left( h_{curvature}^{\prime\; s} \right)} - h_{curvature}^{\prime\; s}}}^{2}} = {\sum\limits_{j = 1}^{2^{m}}{\sum\limits_{h_{curvature}^{\prime\; s} \in {\lbrack{L_{j},L_{j + 1}}\rbrack}}\;\left( {h_{curvature}^{\prime\; s} - z_{j}} \right)^{2}}}}} & \left\lbrack {{Formula}\mspace{20mu} 28} \right\rbrack \end{matrix}$

In other words, in order to be a partial derivative for E(L,z) being 0, L and z are calculated as Formulas 29 and 30 below, then, the above calculation is repeatedly performed until there are no changes in L₁ ^(new) and L₂ _(m) ₊₁ ^(new) compared to a previous result.

$\begin{matrix} {\frac{\delta\; E}{\delta\; z_{j}} = {{\sum\limits_{h_{curvature}^{\prime\; s} \in {\lbrack{L_{j},L_{j + 1}}\rbrack}}{2\left( {h_{curvature}^{\prime\; s} - z_{j}} \right)}} = {{Q\; z_{j}^{new}} = {{average}\mspace{14mu}\left\{ {h_{curvature}^{\prime\; s}❘{h_{curvature}^{\prime\; s} \in \left\lbrack {L_{j},L_{j + 1}} \right\rbrack}} \right\}}}}} & \left\lbrack {{Formula}\mspace{20mu} 29} \right\rbrack \\ {\mspace{79mu}{{\frac{\delta\; E}{\delta\; L_{j}} = 0},{L_{j}^{new} = {\frac{1}{2}\left( {z_{j - 1}^{new} + z_{j}^{new}} \right)}},{j = 2},3,\ldots\mspace{14mu},2^{m}}} & \left\lbrack {{Formula}\mspace{20mu} 30} \right\rbrack \end{matrix}$

After obtaining a quantization parameter Q=(L_(curvature) ^(s)z_(curvature) ^(s)) for all scales and curvatures by the above process, a final binary hash matrix H is generated by using mbit quantizer for the intermediate hash matrix {acute over (H)} having a Q=(L_(curvature) ^(s), Z_(curvature) ^(s))size as the Formula 31 below. Q({acute over (H)})=H, where q({acute over (h)} _(curvature) ^(s) L _(curvature) ^(s) z _(curvature) ^(s))=h _(curvature) ^(s)  [Formula 31]

Then, a hash authentication will be described.

A hash data base HDB of vector model is configured as Table 1 below with quantization parameter Q_(nj) and hashes H_(nj) which are generated when a vector model M_(n), and a random key R_(nj) are provided while generating a hash. In (M_(i),R_(ij),Q_(ij),H_(ij)), a random key R_(ij) is generated by a user, and is combined with a model M_(i) so that a parameter and a hash are generated.

TABLE 1 Parameter matrix Vector model Key matrix (mbit quantization) Hash matrix M₁ R₁₁ Q₁₁ = (L₁₁, z₁₁) H₁₁ R₁₂ Q₁₂ = (L₁₂, z₁₂) H₁₂ . . . . . . . . . M₂ R₂₁ Q₂₁ = (L₂₁, z₂₁) H₂₁ R₂₂ Q₁₁ = (L₂₂, z₂₂) H₂₂ . . . . . . . . . . . . . . . . . . . . . M_(n) R_(n1) Q_(n1) = (L_(n1), z_(n1)) H_(n1) R_(n2) Q_(n2) = (L_(n2), z_(n2)) H_(n2) . . . . . . . . .

In authenticating an arbitrary model M_(n) and a user key R_(nj), a quantization parameter Q_(nj) and a hash H_(ij) for M_(n) and R_(nj) are found from an HDB, and a hash H_(nj)=Hash(M_(n),Q_(nj):R_(nj)) is extracted by using the parameter Q_(nj).

When a normalized Hamming distance difference between the extracted hash H′_(nj) and a primitive hash H_(nj) is d(H_(nj),H′_(nj))<th, M_(n) and K_(nj) are authenticated. The normalized Hamming distance difference is as Formula 32 below.

$\begin{matrix} {{d\left( {H,H^{\prime}} \right)} = {\frac{1}{{scales} \times {curvatures}}{\sum\limits_{s = 1}^{scales}\;{\sum\limits_{{{curvatures} = g},o,a}^{}\;{{h_{curvature}^{s} - h_{curvature}^{\prime\; s}}}}}}} & \left\lbrack {{Formula}\mspace{20mu} 32} \right\rbrack \end{matrix}$

Then, an authentication threshold th will be described.

A threshold is determined by using a hypothesis experiment based on a receiver operation characteristic (ROC). In the hypothesis experiment, a normalized Hamming distance difference between hashes generated by 1000 keys on a vector data model and hashes extracted from attacked models thereof, and a true positive rate (TP) and a false positive rate (FP) are respectively measured by adjusting a threshold th having a range of [0, 0.5] in a unit of 0.05. A TP probability TP is a probability where a hash H′ of an attacked model M′ is authenticated to an original model M_(k), and a probability FP is a probability wherein the hash H′ of the attacked model M′ is authenticated to another model M_(k) (Refer to Formula 33 below). p _(TP) =Pr[d(H,H′)<th] p _(FP) =Pr[d(H _(k) ,H′)<th]  [formula 33]

An ROC that is an experiment result is as shown in FIG. 8, and a curve shown in FIG. 8, it is checked that TP is about 0.95 and FP is about 0.04 when a threshold th is 0.15 which means that the highest TP may be obtained in a low FP. Accordingly, in the present invention, a hash authentication threshold is determined as 0.15.

In other words, FIG. 8 is a view showing an ROC curve of a hash authentication threshold.

In the present invention, in order to perform hierarchical authentication and to prevent a copy of a vector model such as vector map with high accuracy, and design drawing, a vector model hashing based on a multi-scale curvature including robustness, uniqueness, and security performances is purposed. In the purposed hashing, by using representative curvatures which are a radius curvature, a turning angle curvature, and a Gaussian curvature, a multi-dimensional feature matrix based on a multi-scale curve action energy distribution of all polylines and polygon objects is generated. The multi-scale curvature action energy distribution is strong on a rigid motion and a form deformation, thus robustness against various attacks and uniqueness for a model are obtained.

From the multi-dimensional feature coefficients, a multi-dimensional intermediate hash coefficient matrix is obtained by performing randomized mapping for a random coefficient with partial exponential bell polynomials.

In addition, from a real number type intermediate hash coefficient matrix, a final binary hash matrix is obtained by using a Lloyd-Max quantizer.

Herein, security and uniqueness performances for randomized mapping of a curvature action energy are required.

For a multi-dimensional hash, a hierarchical authentication in a scale and a curvature type according to a security level of public and private vector models is possible.

From the experiment result, it is checked that the purposed hashing is robust against an object attack such as object simplification, removing, copying, breaking, etc., and a security thereof is ensured since hash uniqueness for three types which are, a model-key, a key, and a model are excellent, and the purposed hashing has a higher differential entropy by about 0.875 to 1.149 than that of a conventional method.

The present invention may be implemented as computer-readable code on a computer-readable recording medium. The computer-readable recording medium includes all types of storage devices in which computer system-readable data is stored.

Examples of the computer-readable recording medium include Read Only Memory (ROM), Random Access Memory (RAM), Compact Disk-Read Only Memory (CD-ROM), magnetic tape, a floppy disk, and an optical data storage device. Furthermore, the computer-readable recording medium may be implemented as carrier waves (for example, in the case of transmission over the Internet).

Moreover, the computer-readable medium may be distributed across computer systems connected via a network, so that computer-readable code can be stored and executed in a distributed manner. Furthermore, functional programs, codes, and code segments to implement the disclosed embodiments may be easily deduced by programmers skilled in the art thereof.

Although the invention has been shown and described with respect to the preferred embodiments, and specific terms have been used, the preferred embodiments and specific terms are used in their general meaning only in order to easily describe the technical content of the present invention and to facilitate the understanding of the present invention, and are not intended to limit the scope of the present invention. It will be understood by those skilled in the art that various changes and modifications may be made without departing from the spirit and scope of the invention as defined in the following claims. 

The invention claimed is:
 1. A method of protecting a digital model comprising a vector model from being tampered or copied, the method comprising: performing rectangular tiling by dividing the vector model into a plurality of rectangular tiles; and generating a hash for a tile among the plurality of rectangular tiles by using a hash function hash(M.R)=(H.θ) based on a multi-scale curvature, wherein M represents the vector model, R represents a random key, H represents a binary hash, and θ represents a parameter, wherein the hash is generated by: re-sampling objects within the tile; calculating a multi curvature for each scale; and generating the binary hash H by using a Lloyd-Max quantizer and a multi-scale curvature hash coefficient based on the key.
 2. A method of authenticating a digital model comprising a vector model by using the hash generated according to claim 1, the method comprising: extracting a hash H′ by using a hash extraction function Dehash(M′.R.θ)=H′, wherein M′ represents the vector model to be authenticated, R represents the random key, and θ represents the parameter; and authenticating the digital model by comparing the H′ with the H.
 3. The method of claim 1, wherein the performing rectangular tiling includes: generating M={Mj} obtained by dividing the vector model M having a NH×NV size into a rectangular tile having a Nh×Nv size; and generating M_(j)={p_(i)}_(i=1) ^(|M) ^(j) ^(|) by extracting polygon and polyline objects among objects belonging to a number of layers within the divided tile, wherein when an entire size of the vector model M is NH×NV, and a ratio scale is 1/RS, the NH×NV size and an actual size of NH×NV is calculated as (NH×RS×10⁻⁵)×(NV×RS×10⁻⁵)=NH×NV×RS ²×10⁻¹⁰[km ²]N _(H) ×N _(V) ×RS ²×10⁻¹⁰[km ²].
 4. The method of claim 1, wherein, during the re-sampling objects, the objects are re-sampled in a same sampling interval, and re-sampled virtual vertices are generated, when an original object p={v_(i)}_(i=1) ^(p) is provided, a sample vertex for the same sampling interval δ is {circumflex over (p)}={v_(k)}, when a sample vertex v_(k) is between and v_(i−1), the sample vertex v_(k) becomes v_(k)=v_(k−1)+Δd_(k), ∥Δd_(k)∥=δ, v_(k)=(x_(k),y_(k))=(x_(k−1)+Δd_(x),y_(k−1)+Δd_(y)); f(x_(k))=y_(k) by a cubic curve polynomial (cubic polynomial curve) expression corresponding to left/right four vertices {v_(k−2)·v_(k−1)·v_(i)·v_(i−1)} which are two previous resampled vertices {v_(k−2)·v_(k−1)} and two ensuing original vertices {v_(i)·v_(i−1)}, herein, the sample vertex v_(k) corresponding to two previous re-sampled vertices{v_(k−2)·v_(k−1)} and two ensuing original vertices {v_(i)·v_(i+1)} is represented as v_(k−2)<v_(k−1)<v_(k)<v_(i)<v_(i+1), and as a boarder tile of an object end point, when the sample vertex v_(k) is before a last original vertex v_(n), that is v_(k−2)<v_(k−1)<v_(k)<v_(n), or after, that is v_(k−2)<v_(k−1)<v_(n)<v_(k), the sample vertex v_(k) is determined by quadratic curve C_(k)(v_(k)): f(x)=a₀+a₁x+a₂x²+a₃x³ modeling that corresponds to three vertices of {v_(k−2)·v_(k−1)·v_(n)}. 